A Remark on Primality Testing and the Binary Expansion
نویسنده
چکیده
We show that for all sufficiently large integers n, a positive fraction of the primes p between 2 and 2 have the property that p− 2 and p+2 are composite for every 0 ≤ i < n − 1. As a consequence, it is not always possible to test whether a number is prime from its binary expansion without reading all of its digits.
منابع مشابه
A Note On the Storage Requirement for AKS Primality Testing Algorithm
We remark that AKS primality testing algorithm needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits. Such storage requirement is hard to meet in practice. To the best of our knowledge, it is impossible for current operating systems to write and read data in so huge storage space. Thus, the running time for AKS algorithm should not be simply estimated as usual in terms ...
متن کاملA remark on the means of the number of divisors
We obtain the asymptotic expansion of the sequence with general term $frac{A_n}{G_n}$, where $A_n$ and $G_n$ are the arithmetic and geometric means of the numbers $d(1),d(2),dots,d(n)$, with $d(n)$ denoting the number of positive divisors of $n$. Also, we obtain some explicit bounds concerning $G_n$ and $frac{A_n}{G_n}$.
متن کاملA Remark on Primality Testing and Decimal Expansions
We show that for any fixed base a, a positive proportion of primes become composite after any one of their digits in the base a expansion is altered; the case where a = 2 has already been established by Cohen and Selfridge [‘Not every number is the sum or difference of two prime powers’, Math. Comput. 29 (1975), 79–81] and Sun [‘On integers not of the form ±pa ± qb’, Proc. Amer. Math. Soc. 128 ...
متن کاملRandomness, Promise Problems, Randomized Complexity Classes
A big problem that motivates randomized algorithms is that of Primality testing: Given 0 ≤ p ≤ 2, determine if p is prime in poly(n) time. Algorithms such as Miller-Rabin and Solovay-Strassen are randomized algorithms that can solve this in polynomial time, though more recently Agrawal-Kayal-Saxena found a deterministic solution to primality testing. Remark When we say randomized, the goal is f...
متن کاملTwo Observations on Probabilistic Primality Testing
In this note, we make two loosely related observations on Rabin’s probabilistic primality test. The first remark gives a rather strange and provocative reason as to why is Rabin’s test so good. It turns out that a single iteration fails with a non-negligible probability on a composite number of the form 4j +3 only if this number happens to be easy to split. The second observation is much more f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008